- geometric approximation
- геометрическая аппроксимацияпараметр, который определяет, как тесселируется (подразделяется на треугольники) объект при рендеринге.
English-Russian terms in computer graphics and 3D. 2005.
geometric approximation
Смотреть что такое "geometric approximation" в других словарях:
Geometric data analysis — can refer to geometric aspects of image analysis, pattern analysis and shape analysis or the approach of multivariate statistics that treats arbitrary data sets as clouds of points in n dimensional space. This includes topological data analysis,… … Wikipedia
Geometric median — The geometric median of a discrete set of sample points in a Euclidean space is the point minimizing the sum of distances to the sample points. This generalizes the median, which has the property of minimizing the sum of distances for one… … Wikipedia
Geometric invariant theory — In mathematics Geometric invariant theory (or GIT) is a method for constructing quotients by group actions in algebraic geometry, used to construct moduli spaces. It was developed by David Mumford in 1965, using ideas from the paper… … Wikipedia
Geometric phase — In mechanics (including classical mechanics as well as quantum mechanics), the Geometric phase, or the Pancharatnam Berry phase (named after S. Pancharatnam and Sir Michael Berry), also known as the Pancharatnam phase or Berry phase, is a phase… … Wikipedia
Geometric Brownian motion — A geometric Brownian motion (GBM) (occasionally, exponential Brownian motion) is a continuous time stochastic process in which the logarithm of the randomly varying quantity follows a Brownian motion, or a Wiener process. It is applicable to… … Wikipedia
High frequency approximation — A high frequency approximation (or high energy approximation ) for scattering or other wave propagation problems, in physics or engineering, is an approximation whose accuracy increases with the size of features on the scatterer or medium… … Wikipedia
Computer-aided geometric design — (CAGD), also known as geometric modeling, is a branch of computational geometry. It deals with the construction and representation of free form curves, surfaces, or volumes. [Farin, G.: A History of Curves and Surfaces in CAGD,… … Wikipedia
Polynomial-time approximation scheme — In computer science, a polynomial time approximation scheme (abbreviated PTAS) is a type of approximation algorithm for optimization problems (most often, NP hard optimization problems).A PTAS is an algorithm which takes an instance of an… … Wikipedia
Small-angle approximation — is a useful simplification of the laws of trigonometry which is only approximately true for finite angles, but correct in the limit as the angle approaches zero. It involves linearization of the trigonometric functions (truncation of their Taylor … Wikipedia
Paraxial approximation — In geometric optics, the paraxial approximation is an approximation used in ray tracing of light through an optical system (such as a lens).cite book | first=John E. | last=Greivenkamp | year=2004 | title=Field Guide to Geometrical Optics |… … Wikipedia
Stationary phase approximation — In mathematics, the stationary phase approximation is a basic principle of asymptotic analysis, applying to oscillatory integrals taken over n dimensional space Rn where i is the imaginary unit. Here f and g are real valued smooth functions. The… … Wikipedia
